منابع مشابه
Generalized Relational Algebra: Modeling Spatial Queries in Constraint Databases
The introduction of constraints in database languages is an appealing direction. In this paper we present a model for constraint databases, derived from the one proposed in 13], and a family of generalized relational algebra languages, derived from the language proposed in 12] and in 19]. Each language of the family is obtained by specifying a certain logical theory for constraints and a partic...
متن کاملA Constraint Algebra
We propose a constraint algebra in which complex constraint expressions can be built up from primitive constraints using logical connectives like conjunction, disjunction, negation, implication, and equivalence. The algebra facilitates the task of modeling a problem by providing a richer language for representing the problem’s constraints. To propagate such constraint expressions, we need to co...
متن کاملGeneralized boson algebra and its entangled bipartite coherent states
Starting with a given generalized boson algebra U〈q〉(h(1)) known as the bosonized version of the quantum super-Hopf Uq(osp(1|2)) algebra, we employ the Hopf duality arguments to provide the dually conjugate function algebra Fun〈q〉(H(1)). Both the Hopf algebras being finitely generated, we produce a closed form expression of the universal T matrix that caps the duality and generalizes the famili...
متن کاملA Generalized Optical Flow Constraint and its Physical Interpretation
This paper addresses the issue of motion estimation on image sequences. The standard motion equation used to compute the apparent motion of image irradiance patterns is an invariance brightness based hypothesis called the optical flow constraint. Other equations can be used, in particular the extended optical flow constraint, which is a variant of the optical flow constraint, inspired by the fl...
متن کاملAn Extended Algebra for Constraint
| Constraint relational databases use constraints to both model and query data. A constraint relation contains a nite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, depending on the logical theory and the speciic conjunction of constraints, it may possibly represent an in-nite set of relational tuples. For their ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters B
سال: 2020
ISSN: 0370-2693
DOI: 10.1016/j.physletb.2020.135244